Real-time stereo matching architecture based on 2D MRF model: a memory-efficient systolic array
نویسندگان
چکیده
There is a growing need in computer vision applications for stereopsis, requiring not only accurate distance but also fast and compact physical implementation. Global energy minimization techniques provide remarkably precise results. But they suffer from huge computational complexity. One of the main challenges is to parallelize the iterative computation, solving the memory access problem between the big external memory and the massive processors. Remarkable memory saving can be obtained with our memory reduction scheme, and our new architecture is a systolic array. If we expand it into N’s multiple chips in a cascaded manner, we can cope with various ranges of image resolutions. We have realized it using the FPGA technology. Our architecture records 19 times smaller memory than the global minimization technique, which is a principal step toward real-time chip implementation of the various iterative image processing algorithms with tiny and distributed memory resources like optical flow, image restoration, etc.
منابع مشابه
A Real-Time Stereo Matching Hardware Architecture Based on the AD-Census
In this paper, we propose a new stereo matching hardware architecture based on the ADCensus stereo matching algorithm that produces accurate disparity map. The proposed stereo matching hardware architecture is fully pipelined and processes images with disparity level parallelism in real time. Also, it uses modulo memory addressing methods for reducing the size of memory and the usage of hardwar...
متن کاملStereo Matching using FBP: A Memory Efficient Parallel Architecture
There are growing needs in computer vision applications for stereopsis, requiring not only accurate distance but also fast and compact physical implementation. Presently, the global matching techniques provides remarkably robust and precise results in stereo matching. Unfortunately, they suffer from huge computational and memory complexity. We have observed that changing the order of iterative ...
متن کاملHardware - Efficient Belief Propagation
—Loopy belief propagation (BP) is an effective solution for assigning labels to the nodes of a graphical model such as the Markov random field (MRF), but it requires high memory, bandwidth, and computational costs. Furthermore, the iterative, pixel-wise, and sequential operations of BP make it difficult to parallelize the computation. In this paper, we propose two techniques to address these is...
متن کاملA Systolic Design Methodology with Application to Full-Search Block-Matching Architectures
We present a systematic methodology to support the design tradeoffs of array processors in several emerging issues, such as (1) high performance and high flexibility, (2) low cost, low power, (3) efficient memory usage, and (4) system-on-a-chip or the ease of system integration. This methodology is algebraic based, so it can cope with high-dimensional data dependence. The methodology consists o...
متن کاملAn Efficient VLSI Architecture for Full-Search Block Matching Algorithms
This paper presents a novel memory-based VLSI architecture for full search block matching algorithms. We propose a semi-systolic array to meet the requirements of high computational complexity, where data communications are handled in two styles: (1) global connections for search data and (2) local connections for partial sum. Data flow is handled by a multiple-port memory bank so that all proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EURASIP J. Image and Video Processing
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011